Periodic Planar Straight-Frame Drawings with Polynomial Resolution
نویسندگان
چکیده
We present a new algorithm to compute periodic (planar) straight-line drawings of toroidal graphs. Our algorithm is the rst to achieve two important aesthetic criteria: the drawing ts in a straight rectangular frame, and the grid area is polynomial, precisely the grid size is O(n×n). This solves one of the main open problems in a recent paper by Duncan et al. [3].
منابع مشابه
Planar Open Rectangle-of-Influence Drawings with Non-aligned Frames
A straight-line drawing of a graph is an open weak rectangleof-influence (RI) drawing, if there is no vertex in the relative interior of the axis-parallel rectangle induced by the end points of each edge. No algorithm is known to test whether a graph has a planar open weak RI-drawing, not even for inner triangulated graphs. In this paper, we study RI-drawings that must have a non-aligned frame,...
متن کاملPlanar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
We investigate the problem of constructing planar straight-line drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straight-line drawings, deened as the smallest angle formed by two incident edges. We prove the rst nontrivial upper bound on the angular resolution of planar straight-line drawings, and show a continuous trade-oo between the a...
متن کاملMorphing Planar Graphs Drawings Efficiently
A morph between two straight-line planar drawings of the same graph is a continuous transformation from the first to the second drawing such that planarity is preserved at all times. Each step of the morph moves each vertex at constant speed along a straight line. Although the existence of a morph between any two drawings was established several decades ago, only recently it has been proved tha...
متن کاملMorphing Planar Graph Drawings with a Polynomial Number of Steps
In 1944, Cairns proved the following theorem: given any two straight-line planar drawings of a triangulation with the same outer face, there exists a morph (i.e., a continuous transformation) between the two drawings so that the drawing remains straight-line planar at all times. Cairns’s original proof required exponentially many morphing steps. We prove that there is a morph that consists ofO(...
متن کاملPlanar Open Rectangle-of-Influence Drawings
A straight line drawing of a graph is an open weak rectangle-of-influence (RI) drawing, if there is no vertex in the relative interior of the axis parallel rectangle induced by the end points of each edge. Despite recent interest of the graph drawing community in rectangle-of-influence drawings, no algorithm is known to test whether a graph has a planar open weak RI-drawing, not even for inner ...
متن کامل